ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applications
نویسندگان
چکیده
منابع مشابه
Parallel dynamic graph-partitioning for unstructured meshes
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimisation technique known as relative gain optimisation which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...
متن کاملParallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equival...
متن کاملDynamic Load-Balancing for Parallel Adaptive Unstructured Meshes
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refinedmeshes indicate that the algorithmprovides partitions of an equivalent or higher quality to static partitioners ...
متن کاملParallel Automated Adaptive Procedures for Unstructured Meshes
Consideration is given to the techniques required to support adaptive analysis of automatically generated unstructured meshes on distributed memory MIMD parallel computers. The key areas of new development are focused on the support of effective parallel computations when the structure of the numerical discretization, the mesh, is evolving, and in fact constructed, during the computation. All t...
متن کاملParallel Partitioning of Unstructured Meshes
A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance theworkload andminimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering with Computers
سال: 2006
ISSN: 0177-0667,1435-5663
DOI: 10.1007/s00366-006-0039-5